import java.util.Stack;

public class Main {
    public static void main(String[] args) {
        BinaryTree binaryTree=new BinaryTree();
        BinaryTree.TreeNode root =binaryTree.creatTree1();

        binaryTree.size1(root);
        System.out.println(BinaryTree.size);

        System.out.println(binaryTree.size2(root));
        binaryTree.getLeafNodeCount1(root);
        System.out.println("叶子结点个数："+BinaryTree.leafNodeCount);
        System.out.println("叶子结点个数："+binaryTree.getLeafNodeCount2(root));
        System.out.println("第K层得节点个数："+binaryTree.getKLevelNodeCount(root,4));

//        System.out.println(binaryTree.findVal(root, ));
//        System.out.println(binaryTree.findVal(root, ));

        System.out.println(binaryTree.levelOrder(root));
//        BinaryTree.TreeNode rt=binaryTree.creatTree2("AB##CD##F##");
//        System.out.println(binaryTree.preorderTraversal(rt));
//        System.out.println(binaryTree.levelOrder2(rt));

        BinaryTree.TreeNode rt=binaryTree.creatTree2("365##27##4##10##8##");
        System.out.println(binaryTree.preorderTraversal(rt));
        BinaryTree.TreeNode p=new BinaryTree.TreeNode('5');
        BinaryTree.TreeNode q=new BinaryTree.TreeNode('1');

        binaryTree.print(binaryTree.lowestCommonAncestor(rt,p,q));
//        Main main =new Main();
//        main.ok(3);
//        String s1="ABC##DE";
//        TestBinaryTree testBinaryTree=new TestBinaryTree();
//        System.out.println(testBinaryTree.preorderTraversal(testBinaryTree.creatTree2(s1)));
    }

//    void ok(int n){
//        n++;
//        System.out.println(n);
//    }

Stack

}